Combinatorial Representations of Token Sequences

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Combinatorial Representations of Token Sequences

This paper presents new representations of token sequences, with and without associated quantities, in Euclidean space. The representations are free of assumptions about the nature of the sequences or the processes that generate them. Algorithms and applications from the domains of structured interviews and life histories are discussed.

متن کامل

Combinatorial representations

This paper introduces combinatorial representations, which generalise the notion of linear representations of matroids. We show that any family of subsets of the same cardinality has a combinatorial representation via matrices. We then prove that any graph is representable over all alphabets of size larger than some number depending on the graph. We also provide a characterisation of families r...

متن کامل

Type-token representations in conceptual representation

Concepts of kinds of things (e.g. DOG), have the dual function of specifying how to think about indefinitely many things as well as providing the means for thinking about a single abstract kind which is constituted by indefinitely many instances. In this talk, I sketch a theory of conceptual representation that places this dual function of concepts at its core. The theory is shown to provide a ...

متن کامل

Robust Parsing of Cloned Token Sequences

Token-based clone detection techniques are known for their scalability, high recall, and robustness against syntax errors and incomplete code. They, however, may yield clones that are syntactically incomplete and they know very little about the syntactic structure of their reported clones. Hence, their results cannot immediately be used for automated refactorings or syntactic filters for releva...

متن کامل

Representations of Assembly Sequences

This paper analyses four representations for assembly sequences which are based on directed graphs, on AND/OR graphs, on establishment conditions, and on precedence relationships. The latter includes two types: precedence relationships between the establishment of one connection between parts and the establishment of another connection, and precedence relatioships between the establishment of o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Classification

سال: 2005

ISSN: 0176-4268,1432-1343

DOI: 10.1007/s00357-005-0007-6